Three-Valued Abstraction for Continuous-Time Markov Chains
نویسندگان
چکیده
This paper proposes a novel abstraction technique for continuous-time Markov chains (CTMCs). Our technique fits within the realm of three-valued abstraction methods that have been used successfully for traditional model checking. The key idea is to apply abstraction on uniform CTMCs that are readily obtained from general CTMCs, and to abstract transition probabilities by intervals. It is shown that this provides a conservative abstraction for both true and false for a threevalued semantics of the branching-time logic CSL (Continuous Stochastic Logic). Experiments on an infinite-state CTMC indicate the feasibility of our abstraction technique.
منابع مشابه
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
Three-valued Markov chains and their PCTL semantics abstract – via probabilistic simulations – labeled Markov chains and their usual PCTL semantics. This abstraction framework is complete for a PCTL formula if all labeled Markov chains that satisfy said formula have a finite-state abstraction that satisfies it in its abstract semantics. We show that not all PCTL formulae are complete for this a...
متن کاملAbstraction for Stochastic Systems by Erlang's Method of Stages
ion for Stochastic Systems by Erlang’s Method of Stages Joost-Pieter Katoen Daniel Klink Martin Leucker Verena Wolf ISSN 0935–3232 · Aachener Informatik Berichte · AIB-2008-12 RWTH Aachen · Department of Computer Science · June 2008 The publications of the Department of Computer Science of RWTH Aachen University are in general accessible through the World Wide Web. http://aib.informatik.rwth-aa...
متن کاملDon't Know in Probabilistic Systems
In this paper the abstraction-refinement paradigm based on 3-valued logics is extended to the setting of probabilistic systems. We define a notion of abstraction for Markov chains. To be able to relate the behavior of abstract and concrete systems, we equip the notion of abstraction with the concept of simulation. Furthermore, we present model checking for abstract probabilistic systems (abstra...
متن کاملStochastic Dynamic Programming with Markov Chains for Optimal Sustainable Control of the Forest Sector with Continuous Cover Forestry
We present a stochastic dynamic programming approach with Markov chains for optimal control of the forest sector. The forest is managed via continuous cover forestry and the complete system is sustainable. Forest industry production, logistic solutions and harvest levels are optimized based on the sequentially revealed states of the markets. Adaptive full system optimization is necessary for co...
متن کاملCompositional Abstraction for Stochastic Systems
We propose to exploit three-valued abstraction to stochastic systems in a compositional way. This combines the strengths of an aggressive state-based abstraction technique with compositional modeling. Applying this principle to interactive Markov chains yields abstract models that combine interval Markov chains and modal transition systems in a natural and orthogonal way. We prove the correctne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007